Encoding the Hydra Battle as a Rewrite System
نویسنده
چکیده
In rewriting theory, termination of a rewrite system by Kruskal's theorem implies a theoretical upper bound on the complexity of the system. This bound is, however, far from having been reached by known examples of rewrite systems. All known orderings used to establish termination by Kruskal's theorem yield a multiply recursive bound. Furthermore, the study of the order types of such orderings suggests that the class of multiple recursive functions constitutes the least upper bound. Contradicting this intuition, we construct here a rewrite system which reduces by Kruskal's theorem and whose complexity is not multiply recursive. This system is even totally terminating. This leads to a new lower bound for the complexity of totally terminating rewrite systems and rewrite systems which reduce by Kruskal's theorem. Our construction relies on the Hydra battle using classical tools from ordinal theory and subrecursive functions.
منابع مشابه
Rewriting theory for the Hydra battle and the extended Grzegorczyk hierarchy
A subrecursive rewriting framework for the classical Kirby and Paris hydra battle is introduced. The termination of a natural rewrite system RH for the Hydra battle is shown by using ordinals and additionally by proving an upper bound on the derivation lengths in terms of a fast growing function of ordinal index ε0. It is shown that the RH -derivation lengths cannot be bounded by a fast growing...
متن کاملThe Hydra Battle Revisited
Showing termination of the Battle of Hercules and Hydra is a challenge. We present the battle both as a rewrite system and as an arithmetic while program, provide proofs of their termination, and recall why their termination cannot be proved within Peano arithmetic. As a second labour he ordered him to kill the Lernaean hydra. That creature, bred in the swamp of Lerna, used to go forth into the...
متن کاملBeyond Peano Arithmetic - Automatically Proving Termination of the Goodstein Sequence
Kirby and Paris (1982) proved in a celebrated paper that a theorem of Goodstein (1944) cannot be established in Peano (1889) arithmetic. We present an encoding of Goodstein’s theorem as a termination problem of a finite rewrite system. Using a novel implementation of ordinal interpretations, we are able to automatically prove termination of this system, resulting in the first automatic terminat...
متن کاملBeyond polynomials and Peano arithmetic - automation of elementary and ordinal interpretations
Kirby and Paris (1982) proved in a celebrated paper that a theorem of Goodstein (1944) cannot be established in Peano arithmetic. We present an encoding of Goodstein’s theorem as a termination problem of a finite rewrite system. Using a novel implementation of algebras based on ordinal interpretations, we are able to automatically prove termination of this system, resulting in the first automat...
متن کاملInduction of secondary axis in hydra revisited: New insights into pattern formation
In 1909, several years before the famous `Organizer’ experiments of Spemann and Mangold, Ethel Browne demonstrated induction of a secondary axis in hydra by grafting a hypostome. Based on this and subsequent work, in the late sixties, Lewis Wolpert proposed the theory of morphogen gradients and positional information. We have studied secondary axis induction by hypostome and foot tissue using t...
متن کامل